Super-bits, Demi-bits, and NP/qpoly-natural Proofs
نویسنده
چکیده
We introduce the super-bit conjecture, which allows the development of a theory generalizing the notion of pseudorandomness so as to fool non-deterministic statistical tests. This new kind of pseudorandomness rules out the existence of N P=poly-natural properties that can work against P=poly. This is an important extension of the original theory of P=poly-natural proofs 10]. We also introduce the closely related demi-bit conjecture which is more intuitive and is the source of interesting open problems.
منابع مشابه
QMA/qpoly ⊆ PSPACE/poly: De-Merlinizing Quantum Protocols
This paper introduces a new technique for removing existential quantifiers over quantum states. Using this technique, we show that there is no way to pack an exponential number of bits into a polynomial-size quantum state, in such a way that the value of any one of those bits can later be proven with the help of a polynomial-size quantum witness. We also show that any problem in QMA with polyno...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملHardness of Approximate Hypergraph Coloring
We introduce the notion of covering complexity of a probabilistic verifier. The covering complexity of a verifier on a given input is the minimum number of proofs needed to “satisfy” the verifier on every random string, i.e., on every random string, at least one of the given proofs must be accepted by the verifier. The covering complexity of PCP verifiers offers a promising route to getting str...
متن کاملQMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols
This paper introduces a new technique for removing existential quantifiers over quantum states. Using this technique, we show that there is no way to pack an exponential number of bits into a polynomial-size quantum state, in such a way that the value of any one of those bits can later be proven with the help of a polynomial-size quantum witness. We also show that any problem in QMA with polyno...
متن کاملNotes on Complexity Theory Last updated : November , 2011 Lecture 21
Work on interactive proof systems motivates further exploration of non-interactive proof systems (e.g., the class NP). One specific question is: how many bits of the proof does the verifier need to read? Note that in the usual certificate-based definition of NP, the deterministic “verifier” reads the entire certificate, and correctness and soundness hold with probability 1. If we allow the veri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997